Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Incremental data-driven learning of a novelty detection model for one-class classification with application to high-dimensional noisy data

Identifieur interne : 003B76 ( Main/Exploration ); précédent : 003B75; suivant : 003B77

Incremental data-driven learning of a novelty detection model for one-class classification with application to high-dimensional noisy data

Auteurs : Randa Kassab [France] ; Frédéric Alexandre [France]

Source :

RBID : Pascal:09-0161503

Descripteurs français

English descriptors

Abstract

t Most conventional learning algorithms require both positive and negative training data for achieving accurate classification results. However, the problem of learning classifiers from only positive data arises in many applications where negative data are too costly, difficult to obtain, or not available at all. This paper describes a new machine learning approach, called ILoNDF (Incremental data-driven Learning of Novelty Detector Filter). The approach is inspired by novelty detection theory and its learning method, which typically requires only examples from one class to learn a model. One advantage of ILoNDF is the ability of its generative learning to capture the intrinsic characteristics of the training data by continuously integrating the information relating to the relative frequencies of the features of training data and their co-occurrence dependencies. This makes ILoNDF rather stable and less sensitive to noisy features which may be present in the representation of the positive data. In addition, ILoNDF does not require extensive computational resources since it operates on-line without repeated training, and no parameters need to be tuned. In this study we mainly focus on the robustness of ILoNDF in dealing with high-dimensional noisy data and we investigate the variation of its performance depending on the amount of data available for training. To make our study comparable to previous studies, we investigate four common methods: PCA residuals, Hotelling's T2 test, an auto-associative neural network, and a one-class version of the SVM classifier (lately a favored method for one-class classification). Experiments are conducted on two real-world text corpora: Reuters and WebKB. Results show that ILoNDF tends to be more robust, is less affected by initial settings, and consistently outperforms the other methods.

Url:


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Incremental data-driven learning of a novelty detection model for one-class classification with application to high-dimensional noisy data</title>
<author>
<name sortKey="Kassab, Randa" sort="Kassab, Randa" uniqKey="Kassab R" first="Randa" last="Kassab">Randa Kassab</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>LORIA, INRIA Lorraine, Campus Scientifique, BP. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Alexandre, Frederic" sort="Alexandre, Frederic" uniqKey="Alexandre F" first="Frédéric" last="Alexandre">Frédéric Alexandre</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>LORIA, INRIA Lorraine, Campus Scientifique, BP. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">09-0161503</idno>
<date when="2009">2009</date>
<idno type="stanalyst">PASCAL 09-0161503 INIST</idno>
<idno type="RBID">Pascal:09-0161503</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000278</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000749</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000239</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000239</idno>
<idno type="wicri:doubleKey">0885-6125:2009:Kassab R:incremental:data:driven</idno>
<idno type="wicri:Area/Main/Merge">003C73</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00337973</idno>
<idno type="url">https://hal.inria.fr/inria-00337973</idno>
<idno type="wicri:Area/Hal/Corpus">002A61</idno>
<idno type="wicri:Area/Hal/Curation">002A61</idno>
<idno type="wicri:Area/Hal/Checkpoint">002F36</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002F36</idno>
<idno type="wicri:doubleKey">0885-6125:2009:Kassab R:incremental:data:driven</idno>
<idno type="wicri:Area/Main/Merge">003D86</idno>
<idno type="wicri:Area/Main/Curation">003B76</idno>
<idno type="wicri:Area/Main/Exploration">003B76</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Incremental data-driven learning of a novelty detection model for one-class classification with application to high-dimensional noisy data</title>
<author>
<name sortKey="Kassab, Randa" sort="Kassab, Randa" uniqKey="Kassab R" first="Randa" last="Kassab">Randa Kassab</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>LORIA, INRIA Lorraine, Campus Scientifique, BP. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Alexandre, Frederic" sort="Alexandre, Frederic" uniqKey="Alexandre F" first="Frédéric" last="Alexandre">Frédéric Alexandre</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>LORIA, INRIA Lorraine, Campus Scientifique, BP. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Machine learning</title>
<title level="j" type="abbreviated">Mach. learn.</title>
<idno type="ISSN">0885-6125</idno>
<imprint>
<date when="2009">2009</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Machine learning</title>
<title level="j" type="abbreviated">Mach. learn.</title>
<idno type="ISSN">0885-6125</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Artificial intelligence</term>
<term>Cooccurrence analysis</term>
<term>Grammatical inference</term>
<term>Hotelling test</term>
<term>Iterative method</term>
<term>Learning algorithm</term>
<term>Linguistics</term>
<term>Modeling</term>
<term>Multidimensional database</term>
<term>Neural network</term>
<term>Novelty</term>
<term>Paper machine</term>
<term>Principal component analysis</term>
<term>Refinement method</term>
<term>Robustness</term>
<term>Text</term>
<term>Vector support machine</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Intelligence artificielle</term>
<term>Inférence grammaticale</term>
<term>Linguistique</term>
<term>Texte</term>
<term>Nouveauté</term>
<term>Base de données multidimensionnelle</term>
<term>Machine papier</term>
<term>Analyse cooccurrence</term>
<term>Test Hotelling</term>
<term>Modélisation</term>
<term>Classification à vaste marge</term>
<term>Algorithme apprentissage</term>
<term>Méthode raffinement</term>
<term>Méthode itérative</term>
<term>Robustesse</term>
<term>Analyse composante principale</term>
<term>Réseau neuronal</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr">
<term>Intelligence artificielle</term>
<term>Linguistique</term>
</keywords>
<keywords scheme="mix" xml:lang="en">
<term>ILoNDF</term>
<term>neural networks</term>
<term>novelty detection</term>
<term>one-class classification</term>
<term>text categorization</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">t Most conventional learning algorithms require both positive and negative training data for achieving accurate classification results. However, the problem of learning classifiers from only positive data arises in many applications where negative data are too costly, difficult to obtain, or not available at all. This paper describes a new machine learning approach, called ILoNDF (Incremental data-driven Learning of Novelty Detector Filter). The approach is inspired by novelty detection theory and its learning method, which typically requires only examples from one class to learn a model. One advantage of ILoNDF is the ability of its generative learning to capture the intrinsic characteristics of the training data by continuously integrating the information relating to the relative frequencies of the features of training data and their co-occurrence dependencies. This makes ILoNDF rather stable and less sensitive to noisy features which may be present in the representation of the positive data. In addition, ILoNDF does not require extensive computational resources since it operates on-line without repeated training, and no parameters need to be tuned. In this study we mainly focus on the robustness of ILoNDF in dealing with high-dimensional noisy data and we investigate the variation of its performance depending on the amount of data available for training. To make our study comparable to previous studies, we investigate four common methods: PCA residuals, Hotelling's T
<sup>2</sup>
test, an auto-associative neural network, and a one-class version of the SVM classifier (lately a favored method for one-class classification). Experiments are conducted on two real-world text corpora: Reuters and WebKB. Results show that ILoNDF tends to be more robust, is less affected by initial settings, and consistently outperforms the other methods.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>France</li>
</country>
<region>
<li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement>
<li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree>
<country name="France">
<region name="Grand Est">
<name sortKey="Kassab, Randa" sort="Kassab, Randa" uniqKey="Kassab R" first="Randa" last="Kassab">Randa Kassab</name>
</region>
<name sortKey="Alexandre, Frederic" sort="Alexandre, Frederic" uniqKey="Alexandre F" first="Frédéric" last="Alexandre">Frédéric Alexandre</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003B76 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003B76 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Pascal:09-0161503
   |texte=   Incremental data-driven learning of a novelty detection model for one-class classification with application to high-dimensional noisy data
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022